<HTML><HEAD><TITLE>library(ic_edge_finder3)</TITLE></HEAD><BODY>
[ <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]<H1>library(ic_edge_finder3)</H1>
Cubic edge-finder algorithm for disjunctive and
cumulative constraints for IC
<H2>Predicates</H2>
<BLOCKQUOTE>
<DL>
<DT><A HREF="cumulative-4.html"><STRONG>cumulative(+StartTimes, +Durations, +Resources, ++ResourceLimit)</STRONG></A></DT>
<DD>Cumulative constraint on specified tasks.</DD>
<DT><A HREF="cumulative-5.html"><STRONG>cumulative(+StartTimes, +Durations, +Resources, +Areas, ++ResourceLimit)</STRONG></A></DT>
<DD>Cumulative constraint on specified tasks.</DD>
<DT><A HREF="disjunctive-2.html"><STRONG>disjunctive(+StartTimes, +Durations)</STRONG></A></DT>
<DD>Constrain the tasks with specified start times and durations to not overlap in time.</DD>
<DT><A HREF="disjunctive_bools-3.html"><STRONG>disjunctive_bools(+StartTimes, +Durations, ?OrderingBools)</STRONG></A></DT>
<DD>Constrain the tasks with specified start times and durations to not overlap in time.</DD>
</DL>
</BLOCKQUOTE>
<H2>Description</H2>

    This library implements the cubic edge-finder algorithm for the
    disjunctive and cumulative scheduling constraints for the IC solver.
    It provides the strongest propagation of the three libraries for
    cumulative constraints: ic_cumulative, ic_edge_finder and
    ic_edge_finder3.  It is also computationally the most expensive.

    Note that the same predicates are implemented in both ic_edge_finder
    and ic_edge_finder3 libraries.

<H2>About</H2><UL COMPACT>
<LI><STRONG>Author: </STRONG>Joachim Schimpf
<LI><STRONG>Copyright &copy; </STRONG>Cisco Systems, Inc.
<LI><STRONG>Date: </STRONG>$Date: 2009/02/19 05:45:20 $
</UL>
<HR>Generated from ic_edge_finder3.eci on 2009-05-27 01:25
</BODY></HTML>
